Dynamic Step Size Adjustment in Iterative Deepening Search
نویسنده
چکیده
If an iterative deepening search (IDS) procedure has the property that solutions at a given iteration are also found at later iterations, it is possible to skip iterations without loss of correctness. We examine the conditions required for skipping to be worthwhile and give an algorithm for dynamically adapting the skipping to the behaviour of the search procedure. We consider the problem f with solution π, written π |= f . If a solution is found during IDS at depth i, we write π |=i f . We write T (f, i) for the time taken for the ith iteration. We make the following simplifying assumptions:
منابع مشابه
Depth-Bound Heuristics and Iterative-Deepening Search Algorithms in Classical Planning
Heuristics play an important role in classical planning. Using heuristics during state space search often reduces the time required to find a solution, but constructing heuristics and using them to calculate heuristic values takes time, reducing this benefit. Constructing heuristics and calculating heuristic values as quickly as possible is very important to the effectiveness of a heuristic. In...
متن کاملThe PN*-search algorithm: Application to tsume-shogi
This paper proposes a new search algorithm, denoted PN∗, for AND/OR tree search. The algorithm is based on proof-number (PN) search, a best-first search algorithm, proposed by Allis et al. [Artificial Intelligence 66 (1) (1994) 91–124], and on Korf’s RBFS algorithm [Artificial Intelligence 62 (1) (1993) 41–78]. PN∗ combines several existing ideas. It transforms a best-first PN-search algorithm ...
متن کاملIterative Widening
We propose a method to gradually expand the moves to consider at the nodes of game search trees. The algorithm begins with an iterative deepening search using the minimal set of moves, and if the search does not succeed, iteratively widens the set of possible moves, performing a complete iterative deepening search after each widening. When designing carefully the different sets of possible move...
متن کاملUsing Iterative Deepening for Probabilistic Logic Inference
We present a novel approach that uses an iterative deepening algorithm in order to perform probabilistic logic inference for ProbLog, a probabilistic extension of Prolog. The most used inference method for ProbLog is exact inference combined with tabling. Tabled exact inference first collects a set of SLG derivations which contain the probabilistic structure of the ProbLog program including the...
متن کامل